MSO on the Infinite Binary Tree: Choice and Order
نویسندگان
چکیده
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by Gurevich and Shelah using set theoretical arguments. Our proof is much simpler and only uses basic tools from automata theory. We discuss some applications of the result concerning unambiguous tree automata and definability of winning strategies in infinite games. In a second part we strengthen the result of the non-existence of an MSO-definable well-founded order on the infinite binary tree by showing that every infinite binary tree with a well-founded order has an undecidable MSO-theory.
منابع مشابه
Choice Functions and Well-Orderings over the Infinite Binary Tree
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by Gurevich and Shelah using set theoretical arguments. Our proof is much simpler and only uses basic tools from automata theory. We show how the result can be used to prove the inherent ambiguity of languages of infinite...
متن کامل15 Prefix-Recognizable Graphs and Monadic Logic
In 1969, Rabin [148] showed that the monadic second-order theory (MSO-theory) of infinite binary trees is decidable (see Chapter 12 of this volume or [183]). Ever since, it has been an interesting goal to extend this result to other classes of objects. Muller and Schupp [135] showed that the class of pushdown graphs has a decidable MSO-theory. This class is obtained by considering the configura...
متن کاملRelating Paths in Transition Systems: the Fall of the Modal mu-Calculus
This is an extended abstract of a paper presented at MFCS 2015 [11]. Monadic second-order logic (MSO) is considered as a standard for comparing expressiveness of logics of programs. Ground-breaking results concerning expressiveness and decidability of MSO on infinite graphs were obtained first on “freely-generated” structures (words, trees, tree-like structures, etc.) [28,30], then on “non-free...
متن کاملWeak MSO+U with Path Quantifiers over Infinite Trees
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain automaton model, while emptiness for the automaton model is decided using profinite trees. This paper presents a logic over infinite trees with decidable sat...
متن کاملOn the Decidability of MSO+U on Infinite Trees
This paper is about mso+u, an extension of monadic secondorder logic, which has a quantifier that can express that a property of sets is true for arbitrarily large sets. We conjecture that the mso+u theory of the complete binary tree is undecidable. We prove a weaker statement: there is no algorithm which decides this theory and has a correctness proof in zfc. This is because the theory is unde...
متن کامل